On encoding symbol degrees of array BP-XOR codes
نویسندگان
چکیده
منابع مشابه
Asymptotically MDS Array BP-XOR Codes
Belief propagation or message passing on binary erasure channels (BEC) is a low complexity decoding algorithm that allows the recovery of message symbols based on bipartite graph prunning process. Recently, array XOR codes have attracted attention for storage systems due to their burst error recovery performance and easy arithmetic based on Exclusive OR (XOR)-only logic operations. Array BP-XOR...
متن کاملArray Codes with Optimal Encoding
We present a new class of MDS array codes of size n n (n a prime number) called X-Code. The X-Codes are of minimum column distance 3, namely, they can correct either one column error or two column erasures. The key novelty in X-Code is that it has a simple geometrical construction which achieves encoding/update optimal complexity, i.e., a change of any single information bit a ects exactly two ...
متن کاملCodes And Xor Graph Products
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0, 1, 2}n such that the Hamming distance between every two is odd? We investigate these questions, and more general ones, by studying Xor powers of graphs, focusing on their independence number and ...
متن کاملExploiting Multiple Degrees of Bp Parallelism on the Highly
PARALLEL COMPUTER AP1000 J Torresen1=2, S Mori1, H Nakashima1, S Tomita1, O Landsverk2 1Kyoto University, Japan 2The Norwegian Institute of Technology, Norway ABSTRACT During the last years, several neurocomputers have been developed, but still general purpose computers are an alternative to these special purpose computers. This paper describes a mapping of the backpropagation learning algorith...
متن کاملX-Code: MDS Array Codes with Optimal Encoding
We present a new class of MDS array codes of size n n (n a prime number) called X-Code. The X-Codes are of minimum column distance 3, namely, they can correct either one column error or two column erasures. The key novelty in X-code is that it has a simple geometrical construction which achieves encoding/update optimal complexity, namely, a change of any single information bit a ects exactly tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography and Communications
سال: 2015
ISSN: 1936-2447,1936-2455
DOI: 10.1007/s12095-015-0134-9